Attributed Graph Kernels Using the Jensen-Tsallis q-Differences
نویسندگان
چکیده
We propose a family of attributed graph kernels based on mutual information measures, i.e., the Jensen-Tsallis (JT) q-differences (for q ∈ [1, 2]) between probability distributions over the graphs. To this end, we first assign a probability to each vertex of the graph through a continuous-time quantum walk (CTQW). We then adopt the tree-index approach [1] to strengthen the original vertex labels, and we show how the CTQW can induce a probability distribution over these strengthened labels. We show that our JT kernel (for q = 1) overcomes the shortcoming of discarding non-isomorphic substructures arising in the R-convolution kernels. Moreover, we prove that the proposed JT kernels generalize the Jensen-Shannon graph kernel [2] (for q = 1) and the classical subtree kernel [3] (for q = 2), respectively. Experimental evaluations demonstrate the effectiveness and efficiency of the JT kernels.
منابع مشابه
Nonextensive Information Theoretic Kernels on Measures
Positive definite kernels on probability measures have been recently applied to classification problems involving text, images, and other types of structured data. Some of these kernels are related to classic information theoretic quantities, such as (Shannon’s) mutual information and the JensenShannon (JS) divergence. Meanwhile, there have been recent advances in nonextensive generalizations o...
متن کاملNonextensive Generalizations of the Jensen-Shannon Divergence
Convexity is a key concept in information theory, namely via the many implications of Jensen’s inequality, such as the non-negativity of the Kullback-Leibler divergence (KLD). Jensen’s inequality also underlies the concept of Jensen-Shannon divergence (JSD), which is a symmetrized and smoothed version of the KLD. This paper introduces new JSD-type divergences, by extending its two building bloc...
متن کاملInformation theoretic graph kernels
This thesis addresses the problems that arise in state-of-the-art structural learning methods for (hyper)graph classification or clustering, particularly focusing on developing novel information theoretic kernels for graphs. To this end, we commence in Chapter 3 by defining a family of Jensen-Shannon diffusion kernels, i.e., the information theoretic kernels, for (un)attributed graphs. We show ...
متن کاملNon-Archimedean stability of Cauchy-Jensen Type functional equation
In this paper we investigate the generalized Hyers-Ulamstability of the following Cauchy-Jensen type functional equation$$QBig(frac{x+y}{2}+zBig)+QBig(frac{x+z}{2}+yBig)+QBig(frac{z+y}{2}+xBig)=2[Q(x)+Q(y)+Q(z)]$$ in non-Archimedean spaces
متن کاملTsallis entropy-based information measures for shot boundary detection and keyframe selection
Automatic shot boundarydetection andkeyframe selection constitute major goals in video processing. We propose two different information-theoretic approaches to detect the abrupt shot boundaries of a video sequence. These approaches are, respectively, based on two information measures, Tsallis mutual information and Jensen–Tsallis divergence, that are used to quantify the similarity between two ...
متن کامل